Classification of linear differential operators with an invariant subspace of monomials

A complete classification of linear differential operators possessing finite-dimensional invariant subspace with a basis of monomials is presented.Comment: 10 p

Explicit bracket in the exceptional simple Lie superalgebra cvect(0|3)_*

This note is devoted to a more detailed description of one of the five simple exceptional Lie superalgebras of vector fields, cvect(0|3)_*, a subalgebra of vect(4|3). We derive differential equations for its elements, and solve these equations. Hence we get an exact form for the elements of cvect(0|3)_*. Moreover we realize cvect(0|3)_* by "glued" pairs of generating functions on a (3|3)-dimensional periplectic (odd symplectic) supermanifold and describe the bracket explicitly.Comment: 15 pages, Latex twice, no picture

Tight bounds for break minimization

We consider round-robin sports tournaments with n teams and n − 1 rounds. We construct an infinite family of opponent schedules for which every home-away assignment induces at least 1/4 n(n−2) breaks. This construction establishes a matching lower bound for a corresponding upper bound from the literature

Cyclic transfers in school timetabling

In this paper we propose a neighbourhood structure based\ud on sequential/cyclic moves and a Cyclic Transfer algorithm for the high school timetabling problem. This method enables execution of complex moves for improving an existing solution, while dealing with the challenge of exploring the neighbourhood efficiently. An improvement graph is used in which certain negative cycles correspond to the neighbours; these cycles are explored using a recursive method. We address the problem of applying large neighbourhood structure methods on problems where the cost function is not exactly the sum of independent cost functions, as it is in the set partitioning problem. For computational experiments we use four real world datasets for high school timetabling in the Netherlands and England. We present results of the cyclic transfer algorithm with different settings on these datasets. The costs decrease by 8% to 28% if we use the cyclic transfers for local optimization compared to our initial solutions. The quality of the best initial solutions are comparable to the solutions found in practice by timetablers

Cyclic transfers in school timetabling

In this paper we propose a neighbourhood structure based on sequential/cyclic moves and a cyclic transfer algorithm for the high school timetabling problem. This method enables execution of complex moves for improving an existing solution, while dealing with the challenge of exploring the neighbourhood efficiently. An improvement graph is used in which certain negative cycles correspond to the neighbours; these cycles are explored using a recursive method. We address the problem of applying large neighbourhood structure methods on problems where the cost function is not exactly the sum of independent cost functions, as it is in the set partitioning problem. For computational experiments we use four real world data sets for high school timetabling in the Netherlands and England.We present results of the cyclic transfer algorithm with different settings on these data sets. The costs decrease by 8–28% if we use the cyclic transfers for local optimization compared to our initial solutions. The quality of the best initial solutions are comparable to the solutions found in practice by timetablers

Round-robin tournaments with minimum number of breaks and two teams per club

We study round-robin tournaments for 2n teams. Here n is either interpreted as the number of clubs, each having two teams, or the number of strength groups with two teams each. For even n we give a construction of a single round-robin tournament for 2n teams with 2n - 2 breaks, where the teams of the same club have complementary home-away patterns and play against each other in the first round. If the pairs of teams are strength groups, then a cyclic permutation of the constructed schedule results in a group-balanced tournament

Integral multidisciplinary rehabilitation treatment planning

This paper presents a methodology to plan treatments for rehabilitation outpatients. These patients require a series of treatments by therapists from various disciplines. In current practice, when treatments are planned, a lack of coordination between the different disciplines, along with a failure to plan the entire treatment plan at once, often occurs. This situation jeopardizes both the quality of care and the logistical performance. The multidisciplinary nature of the rehabilitation process complicates planning and control. An integral treatment planning methodology, based on an integer linear programming (ILP) formulation, ensures continuity of the rehabilitation process while simultaneously controlling seven performance indicators including access times, combination appointments, and therapist utilization. We apply our approach to the rehabilitation outpatient clinic of the Academic Medical Center (AMC) in Amsterdam, the Netherlands. Based on the results of this case, we are convinced that our approach can be valuable for decision-making support in resource capacity planning and control at many rehabilitation outpatient clinics. The developed model will be part of the new hospital information system of the AMC